#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
int n,a[N],ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);ans=n;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    if(n==1){puts("1");return 0;}
    sort(a+1,a+n+1);
    for(int i=2,j=1;i<=n;){
        if(a[i]>a[j]){
            ans--,i++,j++;
        }
        if(a[i] == a[j])i++;
    }
    printf("%d\n",ans);
    return 0;
}
